منابع مشابه
Principal eigenvectors of irregular graphs
Let G be a connected graph. This paper studies the extreme entries of the principal eigenvector x of G, the unique positive unit eigenvector corresponding to the greatest eigenvalue λ1 of the adjacency matrix of G. If G has maximum degree ∆, the greatest entry xmax of x is at most 1/ q 1 + λ1/∆. This improves a result of Papendieck and Recht. The least entry xmin of x as well as the principal r...
متن کاملEla Principal Eigenvectors of Irregular Graphs∗
Let G be a connected graph. This paper studies the extreme entries of the principal eigenvector x of G, the unique positive unit eigenvector corresponding to the greatest eigenvalue λ1 of the adjacency matrix of G. If G has maximum degree ∆, the greatest entry xmax of x is at most 1/ q 1 + λ1/∆. This improves a result of Papendieck and Recht. The least entry xmin of x as well as the principal r...
متن کاملDegree and Principal Eigenvectors in Complex Networks
The largest eigenvalue λ1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the principal eigenvector corresponding to the largest e...
متن کاملSynchronizing automata and principal eigenvectors of the underlying digraphs
A coloring of a digraph with a fixed out-degree k is a distribution of k labels over the edges resulting in a deterministic finite automaton. An automaton is called synchronizing if there exists a word which sends all states of the automaton to a single state. In the present paper we study connections between spectral and synchronizing properties of digraphs. We show that if a coloring of a dig...
متن کاملAnalytic Connectivity in General Hypergraphs
In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger’s inequality and also give a bound on analytic connectivity with respect to the degree sequence and diameter of a hypergraph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2019
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2019.1691491